Computing Books written by Simon L. Peyton Jones

The following is a list of Computing Books written by Simon L. Peyton Jones in the Centre for Computing History collection. It is not an exhaustive list of and other books may have been published. If you have a book that you would like to donate to our collection, please view our donations page.

There are 2 Computing Books written by Simon L. Peyton Jones in our collection :
Order By : Title - Release Date - Publisher
The Implementation of Functional Programming Languages (Hardback) Date: 1987 The Implementation of Functional Programming Languages (Hardback)

From the blurb:

'The Implementation of Functional Programming Languages provides a detailed description of the implementation of a high-level functional programming language using graph reduction.

The book is divided into three parts.  Part I, Compiling High-level Functional Languages, describes the translation of a high-level functional lnaguage into an intermediate language, the lambda calculus.  Part II, Graph Reduction, begins with a simple implementation of the lambda calculus, based on graphic reduction, and then develops a number of refinements and alterantives, such as supercombinators and full laziness.  Part III, Advanced Graphi Reduction, describes the G-machine, a sophisticated implementatino of graph reduction, which allows  adramatic increase in performance over implementations described earlier int he book.'

Publisher: Prentice/Hall International
Author: Simon L. Peyton Jones
Platform:

The Implementation of Functional Programming Languages (Paperback) Date: 1987 The Implementation of Functional Programming Languages (Paperback)

From the blurb:

'The Implementation of Functional Programming Languages provides a detailed description of the implementation of a high-level functional programming language using graph reduction.

The book is divided into three parts.  Part I, Compiling High-level Functional Languages, describes the translation of a high-level functional lnaguage into an intermediate language, the lambda calculus.  Part II, Graph Reduction, begins with a simple implementation of the lambda calculus, based on graphic reduction, and then develops a number of refinements and alterantives, such as supercombinators and full laziness.  Part III, Advanced Graphi Reduction, describes the G-machine, a sophisticated implementatino of graph reduction, which allows  adramatic increase in performance over implementations described earlier int he book.'

Publisher: Prentice/Hall International
Author: Simon L. Peyton Jones
Platform:

Help support the museum by buying from the museum shop

View all items

Founding Sponsors
redgate Google ARM Real VNC Microsoft Research
Heritage Lottery Funded
Heritage Lottery Fund
Accredited Museum